Close
Metadata

1. Identity statement
Reference TypeConference Paper (Conference Proceedings)
Sitesibgrapi.sid.inpe.br
Holder Codeibi 8JMKD3MGPEW34M/46T9EHH
Identifier8JMKD3MGPAW/3MC927E
Repositorysid.inpe.br/sibgrapi/2016/09.01.13.41
Last Update2016:09.02.13.09.33 (UTC) administrator
Metadata Repositorysid.inpe.br/sibgrapi/2016/09.01.13.41.44
Metadata Last Update2022:05.18.22.21.09 (UTC) administrator
Citation KeyRivaCampPont:2016:ApInCl
TitleAprendizado incremental e classe-incremental por meio da atualização de árvores geradoras em florestas de caminhos ótimos
FormatOn-line
Year2016
Access Date2024, May 03
Number of Files1
Size388 KiB
2. Context
Author1 Riva, Mateus
2 Campos, Teófilo de
3 Ponti, Moacir
Affiliation1 ICMC/Universidade de São Paulo
2 CVSSP/University of Surrey, FGA/Universidade de Brasília
3 ICMC/Universidade de São Paulo
EditorAliaga, Daniel G.
Davis, Larry S.
Farias, Ricardo C.
Fernandes, Leandro A. F.
Gibson, Stuart J.
Giraldi, Gilson A.
Gois, João Paulo
Maciel, Anderson
Menotti, David
Miranda, Paulo A. V.
Musse, Soraia
Namikawa, Laercio
Pamplona, Mauricio
Papa, João Paulo
Santos, Jefersson dos
Schwartz, William Robson
Thomaz, Carlos E.
e-Mail Addressmar.ee.riva@gmail.com
Conference NameConference on Graphics, Patterns and Images, 29 (SIBGRAPI)
Conference LocationSão José dos Campos, SP, Brazil
Date4-7 Oct. 2016
PublisherSociedade Brasileira de Computação
Publisher CityPorto Alegre
Book TitleProceedings
Tertiary TypeUndergraduate Work
History (UTC)2016-09-02 13:09:33 :: mar.ee.riva@gmail.com -> administrator :: 2016
2022-05-18 22:21:09 :: administrator -> :: 2016
3. Content and structure
Is the master or a copy?is the master
Content Stagecompleted
Transferable1
Keywordsaprendizado incremental
minimum spanning trees
optimum-path forests
AbstractClass-incremental algorithms, where there is the need to update classification models with data that emerges over time, are important in many applications. We report an algorithm for updating optimum-path forests capable of including a new instance, maintaining the properties of the optimum-path trees. In addition to a proof demonstrating that the algorithm maintains the structure of the trees in linear time, the experimental evidence shows the applicability of the method, which starting from a limited model, and after the inclusion of multiple instances, is able to achieve the same accuracy of a classifier trained with the full training set.
Arrangementurlib.net > SDLA > Fonds > SIBGRAPI 2016 > Aprendizado incremental e...
doc Directory Contentaccess
source Directory Content
OPF_CI___SIBGRAPI___WUW__Portugues_.pdf 01/09/2016 10:41 386.2 KiB 
agreement Directory Content
agreement.html 01/09/2016 10:41 1.2 KiB 
4. Conditions of access and use
data URLhttp://urlib.net/ibi/8JMKD3MGPAW/3MC927E
zipped data URLhttp://urlib.net/zip/8JMKD3MGPAW/3MC927E
Languagept
Target FileOPF_CI___SIBGRAPI___WUW__Portugues_(1).pdf
User Groupmar.ee.riva@gmail.com
Visibilityshown
Update Permissionnot transferred
5. Allied materials
Mirror Repositorysid.inpe.br/banon/2001/03.30.15.38.24
Next Higher Units8JMKD3MGPAW/3M2D4LP
Citing Item Listsid.inpe.br/sibgrapi/2016/07.02.23.50 3
sid.inpe.br/banon/2001/03.30.15.38.24 1
Host Collectionsid.inpe.br/banon/2001/03.30.15.38
6. Notes
Empty Fieldsarchivingpolicy archivist area callnumber contenttype copyholder copyright creatorhistory descriptionlevel dissemination doi edition electronicmailaddress group isbn issn label lineage mark nextedition notes numberofvolumes orcid organization pages parameterlist parentrepositories previousedition previouslowerunit progress project readergroup readpermission resumeid rightsholder schedulinginformation secondarydate secondarykey secondarymark secondarytype serieseditor session shorttitle sponsor subject tertiarymark type url versiontype volume


Close